Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope
نویسندگان
چکیده
منابع مشابه
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
In a fundamental paper in polyhedral combinatorics, Queyranne describes the complete facial structure of a classical object in combinatorial optimization, the single machine scheduling polytope. In the same paper, he answers essentially all relevant algorithmic questions with respect to optimization and separation. In the present paper, motivated by recent applications in the design of optimal ...
متن کاملDecomposition Algorithm for the Single Machine Scheduling Polytope
Given an n-vector p of processing times of jobs, the single machine scheduling polytope C arises as the convex hull of completion times of jobs when these are scheduled without idle time on a single machine. Given a point x ∈ C, Carathéodory’s theorem implies that x can be written as convex combination of at most n vertices of C. We show that this convex combination can be computed from x and p...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn efficient ILP formulation for the single machine scheduling problem
This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. On the basis of analytical and numerical dominance conditions, an efficient integer linear programming formulation is proposed for this problem, aiming at minimizing the maximum lateness (Lmax). Experiments have bee...
متن کاملEfficient Heuristic Optimization in Single Machine Scheduling
In this paper, we present a comparison of heuristic optimization algorithms for single machine scheduling problems with and without arbitrary job release times. The main focus of our analysis is the efficiency of the examined methods, i.e. how they perform under strictly limited computation time. Furthermore, we study the effects of arbitrary release times on problem difficulty and required com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.06.031